Multi Objective Optimization of Time Cost Quality Quantity Using Multi Colony Ant Algorithm
نویسندگان
چکیده
Research on a new metaheuristic for optimization is often initially focused on proof of concept applications. Time and cost are the most important factors to be considered in every construction project. Over the years, many research studies have been conducted to model the time-cost relationship. Construction planners often face the challenge of optimum resources utilization to compromise between different and usually conflicting aspects of projects. Time, cost and quality of project delivery are among the crucial aspects of each project. Ant colony optimization, which was introduced in the early 1990’s as a novel technique for solving hard combinational optimization problem, finds itself currently at this point of its life cycle. In this paper, new metaheuristic multi-colony ant algorithm is developed for the optimization of three objectives time-cost quality with quantity as a trade off problem. The model is also applied to two objectives time – cost trade off problem and the results are compared to those of the existing approaches.
منابع مشابه
Multi-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm
In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers
Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...
متن کاملAN EXTENSION TO STOCHASTIC TIME-COST TRADE-OFF PROBLEM OPTIMIZATION WITH DISCOUNTED CASH FLOW
In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...
متن کاملAnt Colony Optimization for Multi-objective Digital Convergent Product Network
Convergent product is an assembly shape concept integrating functions and sub-functions to form a final product. To conceptualize the convergent product problem, a web-based network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is considered to be a link between two nodes. The aim is to find an optimal tree of functionali...
متن کامل